Taut Distance-Regular Graphs of Odd Diameter
نویسنده
چکیده
Let denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3, and distinct eigenvalues θ0 > θ1 > · · · > θD . Let M denote the Bose-Mesner algebra of . For 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi . We refer to E0 and ED as the trivial idempotents of M . Let E, F denote primitive idempotents of M . We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E ◦ F is a linear combination of two distinct primitive idempotents of M . We show the pair E, F is taut if and only if there exist real scalars α, β such that σi+1ρi+1 − σi−1ρi−1 = ασi (ρi+1 − ρi−1) + βρi (σi+1 − σi−1) (1 ≤ i ≤ D − 1), where σ0, σ1, . . . , σD and ρ0, ρ1, . . . , ρD denote the cosine sequences of E, F , respectively. We define to be taut whenever has at least one taut pair of primitive idempotents but is not 2-homogeneous in the sense of Nomura and Curtin. Assume is taut and D is odd, and assume the pair E, F is taut. We show σi+1 − ασi σσi − σi−1 = βρi − ρi−1 ρρi − ρi−1 , ρi+1 − βρi ρρi − ρi−1 = ασi − σi−1 σσi − σi−1 for 1 ≤ i ≤ D − 1, where σ = σ1, ρ = ρ1. Using these equations, we recursively obtain σ0, σ1, . . . , σD and ρ0, ρ1, . . . , ρD in terms of the four real scalars σ, ρ, α, β. From this we obtain all intersection numbers of in terms of σ, ρ, α, β. We showed in an earlier paper that the pair E1, Ed is taut, where d = (D − 1)/2. Applying our results to this pair, we obtain the intersection numbers of in terms of k, μ, θ1, θd , where μ denotes the intersection number c2. We show that if is taut and D is odd, then is an antipodal 2-cover.
منابع مشابه
On Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملSpectral Characterization of Some Generalized Odd Graphs
Suppose G is a connected, k-regular graph such that Spec G Spec G where G is a distance-regular graph of diameter d with parameters a1 a2 adÿ1 0 and ad > 0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of G in terms of the notion of Ho ̈man Polynomials. Furthermore, G is isomorphic to G if G is one of the odd polygon ...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملOn the Maximum Diameter of a Class of Distance-regular Graphs
If a graph attains the bound (1.1) it is called a Moore graph if g is odd and a generalised polygon if g is even. A lot of work has been done on the classification of these graphs. Moore graphs have been studied by Hoffman and Singleton [8], Bannai and Ito [1], and Damerell [5]. Generalised polygons have been studied by Feit and Higman [7], Benson [3], and Singleton [9]. Biggs ([4]; Chapter 23)...
متن کاملA ug 2 00 5 Almost - bipartite distance - regular graphs with the Q - polynomial property ∗
Let Γ denote a Q-polynomial distance-regular graph with diameter D ≥ 4. Assume that the intersection numbers of Γ satisfy ai = 0 for 0 ≤ i ≤ D − 1 and aD 6= 0. We show that Γ is a polygon, a folded cube, or an Odd graph.
متن کامل